Principal submatrices VI. Cases of equality in certain linear inequalities

On linear forbidden submatrices

In this paper we study the extremal problem of finding how many 1 entries an n by n 0-1 matrix can have if it does not contain certain forbidden patterns as submatrices. We call the number of 1 entries of a 0-1 matrix its weight. The extremal function of a pattern is the maximum weight of an n by n 0-1 matrix that does not contain this pattern as a submatrix. We call a pattern (a 0-1 matrix) li...

Equality of proofs for linear equality

This paper is about equality of proofs in which a binary predicate formalizing properties of equality occurs, besides conjunction and the constant true proposition. The properties of equality in question are those of a preordering relation, those of an equivalence relation, and other properties appropriate for an equality relation in linear logic. The guiding idea is that equality of proofs is ...

Equality in Linear Logic

1 Quantales In this section we introduce the basic deenitions and results of the theory of quantales (a good reference is Ros]). Quantales were introduced by Mulvey ((Mul]) as an algebraic tool for studying representations of non-commutative C-algebras. Informally, a quantale is a complete lattice Q equipped with a product distributive over arbitrary sup's. The importance of quantales for Linea...

Towards characterizing equality in correlation inequalities

For most of the basic inequalities in mathematics we know conditions which completely specify the cases of equality. Many combinatorial correlation inequalities are special cases of the AD-inequality, as explained in [3, 8, 10]. However, for this inequality it seems to be difficult to classify the cases of equality. Certainly this is even more difficult for the much more general inequalities of...

Towards Characterising Equality in Correlation Inequalities